Security Analysis of Two Distance-Bounding Protocols
نویسنده
چکیده
In this paper, we analyze the security of two recently proposed distance bounding protocols called the “Hitomi” and the “NUS” protocols. Our results show that the claimed security of both protocols has been overestimated. Namely, we show that the Hitomi protocol is susceptible to a full secret key disclosure attack which not only results in violating the privacy of the protocol but also can be exploited for further attacks such as impersonation, mafia fraud and terrorist fraud attacks. Our results also demonstrates that the probability of success in a distance fraud attack against the NUS protocol can be increased up to ( 3 4 ) and even slightly more, if the adversary is furnished with some computational capabilities.
منابع مشابه
Security Analysis of the Distance Bounding Protocol Proposed by Jannati and Falahati
In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...
متن کاملTime, computational complexity, and probability in the analysis of distance-bounding protocols
Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity to infer an upper bound of the distance between two agents. We classify such security protocols as Cyber-Physical. Time plays a key role in design a...
متن کاملTimed Analysis of RFID Distance Bounding Protocols
Modelling real time is fundamental to reason about pervasive systems. The formal analysis of some time sensitive security protocols, such as distance bounding protocols, could lead to a more formal approach to time dependent properties formalisation and verification of pervasive systems.
متن کاملEfficient Public-Key Distance Bounding Protocol
Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some applications such as payment systems, using public-key distance bounding protocols is practical as no pre-shared secret is necessary between the p...
متن کاملOptimal Security Limits of RFID Distance Bounding Protocols
In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two specific classes, leaving the security bounds for the general case as an open problem. As for the classification, we introduce the notion of k-previous challenge dependent (k-PCD) protocols where each response bit depends on the ...
متن کامل